Circularity of Planar Graphs
نویسندگان
چکیده
A circular cover of a graph G is a cover {X0, · · · , Xn−1} of the topological space G by closed connected subsets, indexed over Zn, with the following properties: Each element in the cover contains a vertex of G, each vertex of G is contained in at most two elements of the cover, and Xa ∩ Xb 6= ∅ if and only if b − a ∈ {−1, 0, 1}. The circularity of G is the largest integer n for which there is a circular cover of G with n elements. It is known that the circularity of a planar graph is even. We sharpen this result by proving that the circularity of a plane graph is twice the maximum number of disjoint paths joining two faces of G. This result leads to a polynomial-time algorithm which computes the circularity of any connected planar graph.
منابع مشابه
$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملOn the M-polynomial of planar chemical graphs
Let $G$ be a graph and let $m_{i,j}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The $M$-polynomial of $G$ is $M(G;x,y) = sum_{ile j} m_{i,j}(G)x^iy^j$. With $M(G;x,y)$ in hands, numerous degree-based topological indices of $G$ can be routinely computed. In this note a formula for the $M$-polynomial of planar (chemical) graphs which have only vertices...
متن کاملIsotropic Coordinates, Circularity, and Bezout Numbers: Planar Kinematics from a New Perspective
It is commonly recognized that a convenient formulation for problems in planar kinematics is obtained by considering links to be vectors in the complex plane. However, scant attention has been paid to the natural interpretation of complex vectors as isotropic coordinates. These coordinates, often considered a special trick for analyzing four-bar motion, are in fact uniquely suited to two new te...
متن کاملRelative non-Normal Graphs of a Subgroup of Finite Groups
Let G be a finite group and H,K be two subgroups of G. We introduce the relative non-normal graph of K with respect to H , denoted by NH,K, which is a bipartite graph with vertex sets HHK and KNK(H) and two vertices x ∈ H HK and y ∈ K NK(H) are adjacent if xy / ∈ H, where HK =Tk∈K Hk and NK(H) = {k ∈ K : Hk = H}. We determined some numerical invariants and state that when this graph is planar or...
متن کاملDangerous Reference Graphs and Semantic Paradoxes
Abstract. The semantic paradoxes are often associated with self-reference or referential circularity. Yablo [1993], however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay th...
متن کامل